Multi-scale sparse feature point correspondence by graph cuts
نویسندگان
چکیده
منابع مشابه
Stereo Correspondence with Occlusions using Graph Cuts
Given two stereo images of a scene, it is possible to recover a 3D understanding of the scene. This is the primary way that the human visual system estimates depth. This process is useful in applications like robotics, where depth sensors may be expensive but a pair of cameras is relatively cheap. In order to construct depth maps from stereo images, we need to first solve the stereo corresponde...
متن کاملFeature Selection by Joint Graph Sparse Coding
This paper takes manifold learning and regression simultaneously into account to perform unsupervised spectral feature selection. We first extract the bases of the data, and then represent the data sparsely using the extracted bases by proposing a novel joint graph sparse coding model, JGSC for short. We design a new algorithm TOSC to compute the resulting objective function of JGSC, and then t...
متن کاملGraph Wavelets via Sparse Cuts: Extended Version
Modeling information that resides on vertices of large graphs is a key problem in several real-life applications, ranging from social networks to the Internet-of-things. Signal Processing on Graphs and, in particular, graph wavelets can exploit the intrinsic smoothness of these datasets in order to represent them in a both compact and accurate manner. However, how to discover wavelet bases that...
متن کاملFeature-Based Stereo Matching Using Graph Cuts
In this paper, we present a novel feature point based stereo matching algorithm with global energy minimization. The initial disparity map is estimated by considering matching SURF key points between two images inside each homogeneous colour region by an adaptive box matching approach. Next, we improve the initial disparity map with a RANSAC based plane fitting technique which relies on accurac...
متن کاملComputing Visual Correspondence with Occlusions using Graph Cuts
Several new algorithms for visual correspondence based on graph cuts [7, 14, 17] have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly. Specifically, they treat the two input images asymmetrically, and they do not ensure that a pixel corresponds to at most one pixel in the other image. In this paper, we present a new metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2010
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-010-0083-z